On Average and Worst Case Behaviour in Non-Preemptive Priority Queueing
نویسنده
چکیده
In this paper, we derive worst case bounds on delay and backlog for non-preemptive priority queueing systems using network calculus. There are known results for the average behaviour of non-preemptive priority queueing systems from traditional queueing theory. By use of numerical investigations, we compare our worst case bounds to those average behaviour results in order to give a feel as to how conservative the worst case bounds are. A practical application of our results is given for DiffServ-based networks which use simple priority queueing to differentiate several traffic classes by assigning them different delay targets.
منابع مشابه
Non preemptive static priority in network calculus: accuracy and integration with P-GPS
The real-time behaviour of critical real-time systems relies on the real-time behaviour of the network and some method to compute bounds on the traversal time (worst case traversal time – WCTT). Network calculus (NC) is a method designed to compute such bounds, and one challenge is to have tight bounds, i.e. reaching the exact worst case, to avoid over-provisioning. In this paper, we present a ...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملPer-flow guarantees under class-based priority queueing
In this paper, we present an admission control scheme which provides per-flow delay and bandwidth guarantees based solely upon simple class-based strict priority queue-ing. We derive basic properties of the worst-case behaviour in strict priority queueing systems using network calculus. Building upon these properties the flow admission control scheme is devised. The rationale behind this work i...
متن کاملRST-Based Analysis of Multi-Class Multi-Servers Non-Preemptive Priority Queues versus Worst Case IEEE Analysis
In this paper, analysis of non-preemptive priority queues with multiple servers and multiple priority classes is presented. It is assumed that the service times – for all priority classes – are identically and exponentially distributed to simplify the complexity of the residual service time mathematical expression to an extent will enable calculating the average customer waiting time. The paper...
متن کاملCache and Pipeline Sensitive Fixed Priority Scheduling for Preemptive Real-Time Systems
Current schedulability analyses for preemptive systems consider cache behaviour by adding preemption caused cache reload costs. Thereby, they ignore the fact that delays due to cache misses often have a reduced impact because of pipeline effects. In this paper, these methods are called isolated. Pipeline-related preemption costs are not considered at all in current schedulability analyses. This...
متن کامل